A Note on Satisfying Truth-Value Assignments of Boolean Formulas
نویسنده
چکیده
In this paper we define a class of truth-value assignments, called bounded assignments, using a certain substitutional property. We show that every satisfiable Boolean formula has at least one bounded assignment. This allows us to show that satisfying truthvalue assignments of formulas in USAT can be syntactically defined in the language of classical propositional logic. We also discuss a possible application of bounded truth-value assignments in local search and other methods for solving Boolean satisfiability problems.
منابع مشابه
A Fast Deterministic Algorithm for Formulas That Have Many Satisfying Assignments
How can we find any satisfying assignment for a Boolean formula that has many satisfying assignments? There exists an obvious randomized algorithm for solving this problem: one can just pick an assignment at random and check the truth value of the formula for this assignment, this is iterated until a satisfying assignment occurs. Does there exist a polynomial-time deterministic algorithm that s...
متن کاملExploiting QBF Duality on a Circuit Representation
Search based solvers for Quantified Boolean Formulas (QBF) have adapted the SAT solver techniques of unit propagation and clause learning to prune falsifying assignments. The technique of cube learning has been developed to help them prune satisfying assignments. Cubes, however, have not been able to achieve the same degree of effectiveness as clauses. In this paper we demonstrate how a circuit...
متن کاملHiding Satisfying Assignments: Two Are Better than One
The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random kSAT formulas whose clauses are chosen uniformly from among all clauses satisfying some randomly chosen truth assignment A. Unfortunately, instances generated in this manner tend to be relatively easy and can be solved ...
متن کاملSolving SMT Problems with a Costly Decision Procedure by Finding Minimum Satisfying Assignments of Boolean Formulas
An SMT-solving procedure can be implemented by using a SAT solver to find a satisfying assignment of the propositional skeleton of the predicate formula and then deciding the feasibility of the assignment using a particular decision procedure. The complexity of the decision procedure depends on the size of the assignment. In case that the runtime of the solving is dominated by the decision proc...
متن کاملA Note on Approximating Inclusion-Exclusion for k-CNF Formulas
The number of satisfying assignments of k-CNF formulas is computed using the inclusion-exclusion formula for sets of clauses. Recently, it was shown that the information on the sets of clauses of size ≤ log k + 2 already uniquely determines the number of satisfying assignments of k-CNF formulas [1]. The proof was, however, only existential and no explicit procedure was presented. In this paper,...
متن کامل